Recursively Enumerable Subsets of Rq in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine
نویسنده
چکیده
In this paper we compare recursively enumerable subsets of R” in two computing models over real numbers: the Blum-Shub-Smale machine and the oracle Turing machine. We prove that any Turing RE open subset of RY is a BSS RE set, while a Turing RE closed set may not be a BSS RE set. As an application we show that the Julia set of any computable hyperbolic polynomial is decidable in the Turing computing model. @ 1998-Elsevier Science B.V. All rights reserved
منابع مشابه
Computing over the Reals: Foundations for Scientific Computing
We give a detailed treatment of the “bit-model” of computability and complexity of real functions and subsets of R, and argue that this is a good way to formalize many problems of scientific computation. In Section 1 we also discuss the alternative Blum-Shub-Smale model. In the final section we discuss the issue of whether physical systems could defeat the Church-Turing Thesis.
متن کاملSatisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one reduction by polynomial-time Turing machines) for this class. We exhibit a new one based on questions about expressions built from cross produc...
متن کاملA Weak Version of the Blum, Shub, and Smale Model
We propose a weak version of the Blum Shub Smale model of computation over the real numbers. In this weak model only a ``moderate'' usage of multiplications and divisions is allowed. The class of boolean languages recognizable in polynomial time is shown to be the complexity class P poly. The main tool is a result on the existence of small rational points in semi-algebraic sets which is of inde...
متن کاملA pr 2 00 9 POLYNOMIAL HIERARCHY , BETTI NUMBERS AND A REAL ANALOGUE OF TODA ’ S THEOREM
Toda [35] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result which illustrates the power of counting is considered to be a seminal result in computation...
متن کاملNoncomputable functions in the Blum-Shub-Smale model
Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First, we show that, for each natural number d, an oracle for the set of algebraic real numbers of degree at most d is insufficient to allow an oracle BSS-machine to decide membership in the set of algebraic numbers of degree d + 1. We add a number of further results on rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 197 شماره
صفحات -
تاریخ انتشار 1998